On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
نویسندگان
چکیده
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice of the component codes from the set of time varying recursive systematic convolutional codes. The conventional union bound is employed to obtain an upper bound on the bit error probability of the ensemble of serially concatenated turbo codes for the binary-input additive white Gaussian noise (AWGN) channel with coherent detection of antipodal signals and maximum likelihood decoding. The influence of the interleaver length N and the memory length of the component codes m on the ensemble performance is investigated and compared with relevant results for parallel concatenated multiple-turbo codes.
منابع مشابه
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time varying recursive systematic convolutional codes. Following the derivation of the input-output weight enumeration functions of the ensembles of random parallel and serial concatenated ...
متن کاملBounds on the error probability ofml decoding for block and turbo-block codes
The performance of either structured or random turbo-block codes and binary, systematic block codes operating over the additive white Gaussian noise (AWGN) channel, is assessed by upper bounds on the error probabilities of maximum likelihood (ML) decoding. These bounds on the block and bit error probability which depend respectively on the distance spectrum and the input-output weight enumerati...
متن کاملAnalysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers
A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کاملSerial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding
A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer codewords’ bits, and an inner code whose input words are the permuted outer codewords. The construction can be generalized to h cascaded codes separated by h − 1 interleavers. We obtain upper bounds to the average maximum-likelihood bit-error probability of serially conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Transactions on Telecommunications
دوره 11 شماره
صفحات -
تاریخ انتشار 2000